﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NStl.Iterators.Support;
using NUnit.Framework;
using NStl.Linq;
using System.Collections;
using NUnit.Framework.SyntaxHelpers;
using System.Collections.Generic;
using NStl.Iterators;

namespace NStl.NUnit.Linq.LinkedListExtension
{
    [TestFixture]
    public class InsertionFixture
    {
        [Test]
        public void InsertAtFront()
        {
            LinkedList<int> l = new LinkedList<int>();
            for(int i = 0; i < 10; ++i)
                l.Insert(l.Begin(), i);

            ICollection expecetd = new[] {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
            Assert.That(l, Is.EqualTo(expecetd));
            
        }

        [Test]
        public void InsertAtEnd()
        {
            LinkedList<int> l = new LinkedList<int>();
            for (int i = 0; i < 10; ++i)
                l.Insert(l.End(), i);

            ICollection expecetd = new[] {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
            Assert.That(l, Is.EqualTo(expecetd));
        }
        [Test]
        public void InsertAtPosition()
        {
            LinkedList<int> l = new LinkedList<int>(new[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9});

            LinkedListIterator<int> i4 = (LinkedListIterator<int>) l.Begin().Add(4);

            for (int i = 0; i < 3; ++i)
            {
                i4 = l.Insert(i4, i);
                Assert.That(i, Is.EqualTo(i4.Value));
            }

            Assert.That(2, Is.EqualTo(i4.Value));

            ICollection expected = new[] { 0, 1, 2, 3, 2, 1, 0, 4, 5, 6, 7, 8, 9 };
            Assert.That(l, Is.EqualTo(expected));
        }

        [Test]
        public void InsertRangeAtPosition()
        {
            LinkedList<int> l = new LinkedList<int>(new[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9});
            List<int> v = new List<int> {42, 43, 44, 45};

            LinkedListIterator<int> i4 = (LinkedListIterator<int>) l.Begin().Add( 4);

            l.Insert(i4, v.Begin(), v.End());


            ICollection expected = new[] { 0, 1, 2, 3, 42, 43, 44, 45, 4, 5, 6, 7, 8, 9 };
            Assert.That(l, Is.EqualTo(expected));
        }
        [Test]
        public void InsertMultipleAtPosition()
        {
            LinkedList<int> l = new LinkedList<int>(new[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9});

            LinkedListIterator<int> i4 = (LinkedListIterator<int>) l.Begin().Add( 4);

            l.Insert(i4, 4, 42);

            ICollection expected = new[] { 0, 1, 2, 3, 42, 42, 42, 42, 4, 5, 6, 7, 8, 9 };
            Assert.That(l, Is.EqualTo(expected));
        }

        [Test]
        public void AdaptsToIInsertable()
        {
            LinkedList<int> l = new LinkedList<int>(new[] { 0, 1, 2, 3, 4 });

            IOutputIterator<int> inserter = l.InsertIterator(l.Begin());

            IEnumerable<int> toInsert = new[] {42, 43, 44};

            Algorithm.Copy(toInsert.Begin(), toInsert.End(), inserter);

            ICollection expected = new[] { 44, 43, 42, 0, 1, 2, 3, 4 };

            Assert.That(l, Is.EqualTo(expected));
        }
        [Test]
        public void ImplementsFrontInsertion()
        {
            List<int> expected = new List<int> { 0, 1, 2, 3, 4, 5, 6, 7, 8 };
            LinkedList<int> frontInsertable = new LinkedList<int>();

            Algorithm.Copy(expected.Begin(), expected.End(), frontInsertable.AddFirstInserter());
            Algorithm.Reverse(expected.Begin(), expected.End());
            Assert.That(frontInsertable, Is.EqualTo(expected));
        }
    }
}